Increasing speed of data compression

ABSTRACT

A computer implemented method of performing data compression includes applying, with a computing device, a hash function to a selected part of a character string to calculate a hash value; searching, using the hash value, through entries in a bucket chain having the hash value previously registered in a hash table, and finding a longest matching character string; acquiring, an index indicating that a longest matching character string cannot be found in the search through the entries and thus the search operation is wasted; and switching the hash function to a different hash function for expanding the selected part of the character string, without reconstructing the hash table, when the index exceeds a predetermined threshold.

FOREIGN PRIORITY

This application claims priority to Japanese Patent Application No.2014-061524, filed Mar. 25, 2014, and all the benefits accruingtherefrom under 35 U.S.C. §119, the contents of which in its entiretyare herein incorporated by reference.

BACKGROUND

The present invention relates to a technique for increasing the speed ofdata compression, and more specifically, it relates to a technique forperforming data compression by applying a hash function to a selectedpart of a character string to calculate a hash value, searching, usingthe hash value, through entries in a bucket chain that has the hashvalue which is previously registered in a hash table, and finding alongest matching character string.

In compressing a file, for example, zip, LHA, gzip, bzip2, or LZMA(Lempel-Ziv-Markov chain-Algorithm) has been used hitherto. In the caseof bzip2, a method called blocking sorting is used to achieve a highcompression rate. In contrast, zip, LHA, and gzip use a combined methodof LZ77 coding and Huffman coding. The LZ77 coding is one ofdictionary-based coding methods, in which an input character string(also a symbol string) is registered in a dictionary and encoding isperformed using the dictionary.

Dictionary-based coding methods include a static dictionary method andan adaptive dictionary method (also called a dynamic dictionary method).In the static dictionary method, a dictionary is compiled prior toencoding, and encoding is performed based on the dictionary. The staticdictionary method needs the same dictionary to be prepared for encodingand decoding. In a method in which a dictionary for decoding is attachedto a file, a significant decrease in the compression rate is thusinevitable.

On the other hand, in the adaptive dictionary method, a dictionary isnot prepared beforehand and instead is compiled while a file (inputstream) is being read. Then, when a character string already registeredin the dictionary appears, the character string is converted into aposition index in the dictionary for compression. In the adaptivedictionary method, the dictionary is empty in the beginning and thus acharacter string cannot be compressed at an initial stage. However, asfile reading proceeds, a sufficient number of character strings areregistered in the dictionary, and therefore a high compression rate ofthe file can be achieved.

As adaptive dictionary methods, for example, RLE, BPE, Deflate, and LZcoding (Ziv-Lempel coding) are known. As the LZ coding, for example,LZ77, LZ78, LZSS, LZW, LZML, LZO, LZMA, LZX, LZRW, LZJB, LZT and ROLZare known.

Among the above-mentioned adaptive dictionary methods, the LZ coding isthe most well-known method. The LZ coding is roughly categorized intothe LZ77 coding (developed in 1977) and the LZ78 coding (developed in1978). The LZ77 coding and the LZ78 coding are different in the way ofcompiling a dictionary. In the LZ77 coding, a dictionary is compiled inaccordance with a sliding dictionary method, while, in the LZ78 coding,a dictionary is compiled in accordance with a dynamic dictionary method.

The LZ77 coding has many variations. Among them, a widely-used coding ingeneral is the LZSS coding. In the LZSS coding, a sliding window and alongest matching method are used. In programming the LZSS coding, aprocess of searching a reference part of the sliding window for alongest matching string sequence is performed. In the process forsearching for a longest matching sequence, a hash method is used. Thatis, in the LZSS compression, a hash table is used in order to reduce thetime required for a search for a longest matching sequence. Aregistration of a character string to the hash table is done byobtaining, using a hash function, a hash value for the character stringwith a predetermined number of characters from the beginning of theinput character string and then putting the input character string(precisely, a pointer to the character string) to the hash table. Thus,in the LZSS coding, a dictionary is compiled by calculating a hash valuefor each character string while sliding the input character string, andat the same time, a longest matching sequence that matches a characterstring previously registered in the dictionary is identified.

In file compression, various methods have been proposed, aiming atincreasing the compression rate, the compression speed, and the decodingspeed and improving memory requirements.

JP6-83573 describes a process of the LZW coding which utilizes a liststructure of an external hash method for a dictionary search (claim 1).

JP2009-296131 describes a method for selecting a hash function(Summary).

JP11-85771 describes an algorithm-selection mean for selecting one frommultiple pieces of hash value calculation means (Summary).

JP2011-138230 describes achieving a reduction in the size of a data fileand a reduction in search noise (Summary).

JP5-61910 describes performing a search by inputting a search characterstring including multiple characters into hash function generatingmeans, detecting, using a generated hash value, appearance positioninformation of the corresponding characters stored in the above fullindex, and determining whether or not the detected appearance positioninformation of the individual characters corresponds relatively to theorder of position of the search character string (Summary).

JP2010-515114 describes a method and system regarding efficientprocessing for purposes such as data hashing and/or elimination of dataredundancy (paragraph 0001).

JP2000-57151 describes a technique that enables to increase the speed ofsearch performance and to minimize an increase of the total index size(Summary).

Kunihiko Sadakane et. al., “Improving the Speed of LZ77 Compression byHashing and Suffix Sorting”, IEICE transactions on fundamentals ofelectronics, communications and computer sciences, E83-A, No. 12, pages2689-2698, December 2000, describes improving the speed of the LZ77compression by hashing and suffix sorting (Summary).

SUMMARY

In one embodiment, a computer implemented method of performing datacompression includes applying, with a computing device, a hash functionto a selected part of a character string to calculate a hash value;searching, using the hash value, through entries in a bucket chainhaving the hash value previously registered in a hash table, and findinga longest matching character string; acquiring, an index indicating thata longest matching character string cannot be found in the searchthrough the entries and thus the search operation is wasted; andswitching the hash function to a different hash function for expandingthe selected part of the character string, without reconstructing thehash table, when the index exceeds a predetermined threshold.

In another embodiment, an apparatus for performing data compression,includes a computing device configured to apply a hash function to aselected part of a character string to calculate a hash value, search,using the hash value, through entries in a bucket chain having the hashvalue previously registered in a hash table, and find a longest matchingcharacter string, the computing device further including indexacquisition means for acquiring an index indicating that a longestmatching character string cannot be found in the search through theentries and thus the search operation is wasted; and hash functionswitching means for switching the hash function to a different hashfunction for expanding the selected part of the character string,without reconstructing the hash table, when the index exceeds apredetermined threshold.

In another embodiment, a non-transitory, computer readable storagemedium having computer readable instructions stored thereon that, whenexecuted by a computer, implement a method of performing datacompression. The method includes applying a hash function to a selectedpart of a character string to calculate a hash value; searching, usingthe hash value, through entries in a bucket chain having the hash valuepreviously registered in a hash table, and finding a longest matchingcharacter string; acquiring, an index indicating that a longest matchingcharacter string cannot be found in the search through the entries andthus the search operation is wasted; and switching the hash function toa different hash function for expanding the selected part of thecharacter string, without reconstructing the hash table, when the indexexceeds a predetermined threshold.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram illustrating an example of a computer according toan embodiment of the present invention or a computer which may be usedin an embodiment of the present invention.

FIG. 2 is a diagram for explaining a process of applying ahash-value-updating function to a selected part of a character string tocalculate a hash value, searching, using the calculated hash value,through individual entries in a bucket chain which has the hash valuepreviously registered in a hash table, and finding a longest matchingcharacter string, in accordance with a conventional method.

FIG. 3 is a diagram for explaining that in the case where a hashfunction is applied to a selected part of a character string tocalculate a hash value, according to a conventional method, a hash indexcollision occurs and redundant loop iterations occur in the searchthrough entries of a bucket chain, without finding a longest matchingcharacter string.

FIG. 4 is a diagram for explaining a process of switching a hashfunction to a different hash function that expands a selected part of acharacter string, without reconstructing a hash table, according to anembodiment of the present invention, in the case where an indexindicating that a longest matching character string cannot be found inthe search through individual entries in a bucket chain previouslyregistered in a hash table and thus the search operation is wasted,exceeds a predetermined threshold.

FIG. 5 is a diagram illustrating a process of performing datacompression by switching a hash function to a different hash functionthat expands a selected part of a character string, according to anembodiment of the present invention.

FIG. 6 is a functional block diagram illustrating an example of acomputer that preferably includes the hardware configuration accordingto FIG. 1 and that compresses data according to an embodiment of thepresent invention.

DETAILED DESCRIPTION

In the dictionary-based coding method, symbols are not converted intovariable-length code words. Instead, variable-length character stringswhich are so-called “words” or “phrases” are converted into fixed-lengthcode words or variable-length code words.

In the adaptive dictionary method, a dictionary is not compiledbeforehand. Instead, while reading character strings to be compressed, acomputer registers the character strings into the dictionarysequentially, based on a hash value calculated by applying ahash-value-updating function to the character strings.

In the LZ77 coding, which is one of the adaptive dictionary methods, asliding window is used. In the LZ77 coding, a computer prepares a bufferthat stores a predetermined number of words, and performs encoding usingthe buffer. Since the size of the buffer is limited, old characterstrings need to be discarded by the amount of reading new characterstrings. In the operation, as encoding proceeds, the character stringsstored in the buffer appear as if they were sliding through the entireinput data of character strings. From this, the buffer is also called a“sliding window”.

A sliding window consists of a reference part (for example, a size of16) and an encoding part (for example, a size of 4). The encoding partis a character string to be compressed. For example, in the LZSS codingunder the LZ77 coding, a longest character string that matches theencoding part (also called as a “longest matching sequence”) is searchedfor from the reference part and encoding is performed based on theposition information and the length. For example, when the referencepart of a sliding window is 8192 and the encoding part is 16, then, theposition information has 13 bits, and the length information has 4 bits.Therefore, it is possible to express a code word in a total of 17 bits.However, in this case, a character string of less than two characterscannot be compressed. Encoding is possible only for a character stringof three or more characters.

Referencing a dictionary in encoding operation is implemented bysearching for a character string that matches a character stringstarting from a present encoding target position and that is the longestcharacter string (called a longest matching sequence) in the slidingwindow.

In searching for a longest matching sequence, a process of searching thereference part for a longest matching sequence is important. Forexample, when the size of the sliding window is N and the size of theencoding part is F, a comparing process needs to be performed N×F timesin the worst case. In order to reduce the number of times of comparison,a hash method is used.

In the hash method, an array called a hash table for storing data and ahash function for converting data into numerical values are used. Forexample, when the size of the hash table is N, a hash function convertsdata into integer values within a range from 0 to N−1. The integervalues are hash values. A hash value corresponds to a subscript of thehash table, and data is stored in this position.

When an unspecified number of data are handled in the hash method, asame hash value may be generated from different data. The generation ofthe same hash value is a collision of hash values. When a collision ofhash values has occurred, it is impossible to register data to the hashtable. In order to solve the problem of a collision of hash values, forexample, an open address method or a chain method is employed.

In the open address method, a computer prepares a different hashfunction, and calculates a new hash value by applying the different hashfunction to a character string. Then, the computer, until an empty slotis found in a hash table, repeats the preparation of a different hashfunction and the calculation of a new hash value. When an empty slot isfound, the computer puts data into the slot.

On the other hand, in the chain method, a computer stores multiplepieces of data into a hash table. However, only one piece of data can bestored in an element of the hash table in the chain method. Therefore,the computer prepares a linked list as a data structure. When searchingthe hash table for data, the computer first calculates a hash value, andthen searches for data from the linked list (also called a bucket chain)of an entry that has the same hash value as the calculated hash value.The bucket chain includes character strings that collide due to havingthe same hash value. The character strings are stored in the bucketchain in order from the beginning of the bucket chain. However, when acollision of hash values occurs frequently, the linked list for datastorage becomes longer, and an extra time is required for scanning thelist for a longest matching sequence. Thus, in order to perform a searchoperation efficiently in the chain method, it is important to select anappropriate hash function so as not to cause collisions too often.

In order to execute searching for a longest matching sequenceefficiently, a very lightweight hash function is used. As mentionedabove, in the data compression algorithm, such as a data compressionalgorithm in which a dictionary may be used as a hash table, a longestmatching sequence that matches between the present data of the inputdata (also called an input stream) and the data stored in the hash table(dictionary) is searched for.

FIG. 2 is a diagram for explaining a process of applying ahash-value-updating function to a selected part of a character string tocalculate a hash value, searching, using the hash value, throughindividual entries in a bucket chain which has the hash value previouslyregistered in the hash table, and finding a longest matching characterstring, in accordance with a conventional method.

An input stream (201) is a file as a data compression target andincludes character strings. A computer reads from the input stream (201)predetermined fixed-length bytes of character strings into a buffer(that is, a sliding window) (211). It is assumed that the computer uses,as data to which the hash function described below is to be applied, “i,i+1, i+2”, which is a character string (222) with a predeterminedfixed-length of bytes (3 bytes in the example in FIG. 2) and whosestarting position is the present position of the character string “i”(present position: 221).

The computer applies a hash-value-updating function (241) to theabove-mentioned character string (222) and calculates a hash value h(291). The computer checks (292), using the calculated hash value h,whether the hash value h is registered in the dictionary (251). Thecomputer newly registers the hash value h to the dictionary (251). Whenthe hash value h is already registered in the dictionary (251), thecomputer searches through entries (261, 262, 263, . . . ) in a bucketchain (251 a) that has the hash value h, to find (293) a longestcharacter string that matches the character string starting from thepresent position (221).

In the above example illustrated in FIG. 2, since the above calculatedhash value h is registered in the dictionary (251) and a collision ofthe hash value h has occurred, the computer searches through theindividual entries (261, 262, 263, . . . ) in the bucket chain (251 a)that has the hash value h, to find (293) a longest character string thatmatches the character string starting from the present position (221).The computer searches for the longest matching character string (293) upto the end of the entries (261, 262, 263, . . . ) of the above-mentionedbucket chain (251 a) or up to an upper limit of the search for theentries (261, 262, 263, . . . ). The search upper limit for the entriesmay be set in such a manner that the higher the compression level (forexample, a minimum compression level, a default compression level, or amaximum compression level) of the data compression algorithm (that is,as the compression becomes higher), the larger the number of entries aresearched.

In order to find a longest character string that matches the characterstring starting from the present position (221), the computersequentially compares the character string starting from the presentposition (221) with character strings in the dictionary.

When the computer finds, in the individual entries (261, 262, 263, . . .) in the above-mentioned bucket chain (251 a) associated with the hashvalue h, a character string “abc” (that is, a character string whichmatches a[i]b[i+1]c[i+2]) (since the function (241) for updating thehash value uses 3 bytes in this case, matching with the minimum of 3characters) and a character string “abcd” (that is, a character stringwhich matches a[i]b[i+1]c[i+2]d[i+3]), the computer returns thecharacter string “abcd” as a longest matching character string (alongest matching sequence).

Next, the computer shifts (232), in the sliding window (211), thepresent position by one from the position of the character string “i”(221) to the position of the character string “i+1” (231). Therefore, itis assumed that the computer uses, as data to which the hash functionmentioned below is to be applied, “i+1, i+2, i+3”, which is thecharacter string (232) with a predetermined fixed-length of bytes (3bytes in the example in FIG. 2) and whose starting position is thepresent position of the character string “i+1” (present position: 231).The character string (232) currently being processed, “i+1, i+2, i+3”,includes “i+1, i+2” in the character string “i, i+1, i+2” (222), whichwas processed in the previous operation.

The computer applies the function (241) for updating the hash value tothe above-mentioned character string (232) and calculates a hash valueh′ (295). The computer checks (296), using the calculated hash value h′,whether the hash value h′ is registered in the dictionary (251). Thecomputer newly registers the hash value h′ to the dictionary (251). Whenthe hash value h′ is already registered in the dictionary (251), thecomputer searches through individual entries (281, 282, 283, . . . ) ina bucket chain (251 b) that has the hash value h′, to find (297) alongest character string that matches the character string starting fromthe present position (231).

In the above example illustrated in FIG. 2, since the above calculatedhash value h′ is registered in the dictionary (251) and a collision ofthe hash value h′ has occurred, the computer searches through theindividual entries (281, 282, 283, . . . ) in the bucket chain (251 b)that is associated with the hash value h′, to find (297) a longestcharacter string that matches the character string starting from thepresent position (231). The computer searches for the longest matchingcharacter string (297) up to the end of the entries (281, 282, 283, . .. ) of the above-mentioned bucket chain (251 b) or up to the searchupper limit for the entries (281, 282, 283, . . . ). The search upperlimit for the entries may be set in such a manner that the higher thecompression level (for example, a minimum compression level, a defaultcompression level, or a maximum compression level) of the datacompression algorithm (that is, as the compression becomes higher), thelarger the number of entries are searched.

Thereafter, the computer processes character strings likewise insequence by shifting the present position in the sliding window (211)one by one. After completing the process for the character strings inthe sliding window (211), the computer clears the sliding window (211),reads subsequent character strings of the predetermined fixed-length ofbytes from the input stream (201) to the sliding window (211), andprocesses character strings in the sliding window (211) likewise insequence.

To enhance overall performance, it is necessary that a hash functionitself is lightweight, as described above. In the example illustrated inFIG. 2, a new hash value is calculated by using the previous hash valueand 1 byte of a new input character, unlike an ordinary hash function. Afunction for updating a hash value calculates a new hash value from theprevious hash value and a new byte c according to the followingexpression.

new_value=(((prev_value) <<hash_shift) ̂ (c)) & hash_mask),

new_value: new hash value

prev_value: previous hash value

hash shift: hash shift

c: new byte

hash_mask: hash mask

The above-mentioned hash mask represents masking of a value by the sizeof a hash table. The hash mask is used so that the calculated hash valuefits within the table size of the hash table.

For example, the number of hash bits may be 15 (a hash table size of 32K) and the number of hash shifts may be 5. In the case where the numberof hash shifts is 5, moving the present position by one character shiftsthe previous key by 5 bits. That is, only 5 bits of one character areused for the hash calculation. Therefore, 3 bits in the first byte arenot necessarily used for the hash calculation, which increases theprobability of hash collisions.

FIG. 3 is a diagram for explaining that in the case where a hashfunction is applied to a selected part of a character string tocalculate a hash value, according to a conventional method, a hash indexcollision occurs and redundant loop iterations occur in the searchthrough entries in a bucket chain, without finding a longest matchingcharacter string.

An input stream (301) is a file as a data compression target andincludes character strings. It is assumed that the computer uses, asdata to which the hash function described below is to be applied, “a, a,b”, which is a character string (322) with a predetermined fixed-lengthof bytes (3 bytes in the example in FIG. 3) and whose starting positionis the present position of the character string “a” (present position:321).

The computer applies a hash function (341) that uses 3 bytes of theabove-mentioned character string (322) and calculates a hash value(391). The computer checks (392), using the calculated hash value h,whether the hash value h is registered in a dictionary (351). Thecomputer newly registers the hash value h to the dictionary (351). Whenthe hash value h is already registered in the dictionary (351), thecomputer searches through individual entries (361, 362, 363, 364, . . ., and 365) in a bucket chain (351 a) that has the hash value h, to find(393) a longest character string that matches the character stringstarting from the present position (321).

In the above example illustrated in FIG. 3, since the above calculatedhash value h is registered in the dictionary (351) and a collision ofthe hash value h has occurred, the computer searches through theindividual entries (361, 362, 363, 364, . . . , and 365) in theabove-mentioned bucket chain (351 a) that has the hash value h, to find(393) a longest character string that matches the character stringstarting from the present position (321). The computer searches for thelongest matching character string (393) up to the end of the entries(361, 362, 363, 364, . . . , and 365) in the above-mentioned bucketchain (351 a) or up to the search upper limit for the entries (361, 362,363, 364, . . . , and 365). The search upper limit for the entries maybe set in such a manner that the higher the compression level (forexample, a minimum compression level, a default compression level, or amaximum compression level) of the data compression algorithm (that is,as the compression becomes higher), the larger the number of entries aresearched.

The computer searches through the individual entries (361, 362, 363,364, . . . , and 365) in the above-mentioned bucket chain (351 a) thathas the hash value h, to find a character string that matches acharacter string “aabc”. However, the computer cannot find such an entrythat matches the character string “aabc” by searching through all thespecified entries (for example, 4096 entries in the case of the maximumcompression level). Accordingly, even by searching through a largenumber of entries, a higher compression effect cannot be achieved.

It is assumed that the computer continuously uses, as data to which thehash function described below is to be applied, “a, a, b”, which is acharacter string (332) with a predetermined fixed-length of bytes (3bytes in the example in FIG. 3) and whose starting position is thepresent position of the character string “a” (present position: 331).

The computer applies the hash function (341) that uses 3 bytes to theabove-mentioned character string (332) and calculates a hash value(394). The computer checks (395), using the calculated hash value h,whether the hash value h is registered in the dictionary (351). Thecomputer newly registers the hash value h to the dictionary (351). Whenthe hash value h is already registered in the dictionary (351), thecomputer searches through the individual entries (361, 362, 363, 364, .. . , and 365) in the bucket chain (351 a) that has the hash value h, tofind (396) a longest character string that matches the character stringstarting from the present position (331).

In the above example illustrated in FIG. 3, since the above calculatedhash value h is registered in the dictionary (351) and a collision ofthe hash value h has occurred, the computer searches through theindividual entries (361, 362, 363, 364, . . . , and 365) in the bucketchain (351 a) that has the hash value h, to find (396) a longestcharacter string that matches the character string starting from thepresent position (331). The computer searches for the longest matchingcharacter string (396) up to the end of the entries (361, 362, 363, 364,. . . , and 365) in the above-mentioned bucket chain (351 a) or up tothe search upper limit for the entries (361, 362, 363, 364, . . . , and365). The search upper limit for the entries is set as described above.

The computer searches through the individual entries (361, 362, 363,364, . . . , and 365) in the above-mentioned bucket chain (351 a) thathas the hash value h, to find a character string that matches acharacter string “aabd”. However, the computer cannot find such an entrythat matches the character string “aabd” by searching through all thespecified entries (for example, 4096 entries in the case of the maximumcompression level). Accordingly, even by searching through a largenumber of entries, a higher compression effect cannot be achieved.

In the above examples, character strings (322, 332) have the same firstthree characters “a, a, b” and the different fourth character (“c” inthe case of the character string (322) and “d” in the case of thecharacter string (332)). In such a case, a hash function that uses 3bytes, which is a fixed length, causes a large number of collisions, andas a result, creates a long bucket chain. In addition, without beingable to find a character string that matches the fourth character andthereafter from the entries (361, 362, 363, 364, . . . , and 365) in thebucket chain (351 a), loop iterations occur in the search through theindividual entries (361, 362, 363, 364, . . . , and 365) of the bucketchain (351 a). That is, in the above example, the hash function thatuses 3 bytes, which is a fixed length, generates a clustering result ofthe hash values for some type of character strings (for example, theabove-mentioned character strings (322, 332)), and thus degrades theperformance.

The above-mentioned problem of loop iterations, in particular, when ahigh compression level is specified, could result in unchanged or ratherdecreased compression rate, while a long CPU time is required forcompression.

Accordingly, embodiments of the present invention improve theperformance in data compression, in the case where a longest matchingcharacter string cannot be found in a search through entries in a bucketchain which has a hash value previously registered in a hash table.

Embodiments of the present invention also reduce the number of hashcollisions in the case where a longest matching character string cannotbe found in a search through entries in a bucket chain which has a hashvalue previously registered in a hash table.

Disclosed herein is a technique for increasing the speed of datacompression. The technique may include a method for the datacompression, a computer for performing the data compression, a computerprogram, and a computer program product. Embodiments of the presentinvention, in particular, relates to a compression algorithm forperforming above-mentioned data compression. Embodiments of the presentinvention may include a computer including the above-mentionedcompression algorithm, a computer program, and a computer programproduct.

A first aspect of the present invention provides a method for performingdata compression by applying a hash function to a selected part of acharacter string to calculate a hash value, searching, using the hashvalue, through entries in a bucket chain having the hash valuepreviously registered in a hash table, and finding a longest matchingcharacter string, which includes: acquiring an index indicating that alongest matching character string cannot be found in the search throughthe entries and thus the search operation is wasted; and switching thehash function to a different hash function by expanding the selectedpart of the character string in the hash calculation, withoutreconstructing the hash table, when the index exceeds a predeterminedthreshold, wherein the acquiring and the switching are performed by acomputer.

According to an embodiment of the present invention, the method mayfurther include returning the different hash function to the originalhash function at a specific timing, which is performed by the computer.

According to an embodiment of the present invention, returning thedifferent hash function to the original hash function may be performedat a time when the hash table is cleared or every time that characterstrings of a predetermined length is processed.

According to an embodiment of the present invention, the index mayrepresent a time required for a search when an entry of a characterstring being searched for cannot be found up to the last entry in thebucket chain having the hash value or up to a search upper limit ofentries in the bucket chain having the hash value.

In an embodiment of the present invention, the index may represent afrequency at which an entry of a character string being searched forcannot be found even when the search is performed up to the last entryin the bucket chain having the hash value or even when the search isperformed up to a search upper limit of entries in the bucket chainhaving the hash value.

A second aspect of the present invention provides a computer forperforming data compression by applying a hash function to a selectedpart of a character string to calculate a hash value, searching, usingthe hash value, through entries in a bucket chain having the hash valuepreviously registered in a hash table, and finding a longest matchingcharacter string, which includes: index acquisition means for acquiringan index which indicates that a longest matching character string cannotbe found in the search through the entries and thus the search operationis wasted; and hash function switching means for switching the hashfunction to a different hash function by expanding the selected part ofthe character string in the hash calculation, without reconstructing thehash table, when the index exceeds a predetermined threshold.

According to an embodiment of the present invention, the computer mayfurther include hash function restoration means for restoring thedifferent hash function to the original hash function at a specifictiming.

According to an embodiment of the present invention, the restorationmeans may restore the different hash function to the original hashfunction at a time when the hash table is cleared or every time thatcharacter strings of a predetermined length is processed.

According to an embodiment of the present invention, the index mayrepresent a time required for a search when an entry of a characterstring being searched for cannot be found up to the last entry in thebucket chain having the hash value or up to a search upper limit ofentries in the bucket chain having the hash value.

According to an embodiment of the present invention, the index mayrepresent a frequency at which an entry of a character string beingsearched for cannot be found even when the search is performed up to thelast entry in the bucket chain having the hash value or even when thesearch is performed up to a search upper limit of entries in the bucketchain having the hash value.

A third aspect of the present invention provides a non-transitory,computer readable storage medium having computer readable instructionsstored thereon that, when executed by a computer, implement a method ofperforming data compression according to the first aspect describedabove.

A computer program according to an embodiment of the present inventionmay be stored in desired one or more computer-readable recording media,such as a flexible disk, an MO, a CD-ROM, a DVD, a BD, a hard diskdevice, a memory medium connectable to a USB, a ROM, an MRAM, and a RAM.In order to store the computer program into the recording medium, thecomputer program may be downloaded from a different computer, such as aserver computer, which is connected via a communication line or may beduplicated from a different recording medium. Further, a computerprogram according to an embodiment of the present invention may becompressed or divided into plural programs, and may be stored into asingle or plural recording media. Further, it should be noted thatobviously a computer program product according to an embodiment of thepresent invention may be provided in various forms. A computer programproduct according to an embodiment of the present invention may include,for example, a storage medium on which the above-mentioned computerprogram is recorded or a transmission medium for transmitting theabove-mentioned computer program.

It is obvious that various modifications, such as combining theindividual hardware elements of a computer used in an embodiment of thepresent invention with plural machines, distributing functions to thecombined hardware elements and machines, and causing the combinedhardware elements and machines to execute the functions, may be easilyconceived by those skilled in the art. Such modifications are naturallyincluded in the spirit of the present invention. However, theabove-mentioned elements are merely exemplifications and all theelements are not necessarily essential to the present invention.

Furthermore, embodiments of the present invention may be implemented ashardware, software, or a combination of hardware and software. Executionin a computer into which the above-mentioned computer program isinstalled is a typical example of execution by a combination of hardwareand software. In such a case, by execution of the computer programloaded to a memory of the computer, the computer program controls thecomputer and executes processing according to the present invention. Thecomputer program may include an instruction group that may be expressedby a desired language, code, or notation. Such an instruction groupenables the computer to directly perform processing according to theembodiment of the present invention or to perform the processingaccording to the embodiment of the present invention after one or bothof 1: conversion into a different language, code, or notation; and 2:duplication to a different medium are performed.

According to the embodiments of the present invention, when an indexwhich indicates that a longest matching character string cannot be foundin the search through entries in the bucket chain which has the hashvalue previously registered in the hash table and thus the searchoperation is wasted, exceeds a predetermined threshold, the hashfunction is switched to a different hash function that expands theselected part of the character string, without reconstructing the hashtable. This makes it possible for an arithmetic processing unit (forexample, a CPU) to dynamically avoid wasting time which is required toprocess a long bucket chain. Therefore, the performance in datacompression is improved.

Further, according to the embodiments of the present invention, asmentioned above, the hash function is switched to the different hashfunction that expands the selected part of the character string, withoutreconstructing the hash table, which significantly reduces the number ofhash collisions. Therefore, the performance in data compression isimproved.

Embodiments of the present invention will be described with reference tofigures hereinafter. For all the figures below, the same signs indicatethe same objects unless otherwise stated. It should be understood thatembodiments of the present invention are to describe preferredembodiments of the present invention and are not intended to limit thescope of the invention to what is described here.

A computer which may be used in an embodiment of the present inventionis not limited in particular, as long as it is able to compress data.The computer may be, for example, a mainframe computer, a servercomputer, a desktop computer, a notebook computer, or an all-in-onepersonal computer, or a tablet terminal or a smart phone (for example, atablet terminal or a smart phone with Windows®, Android®, or iOS).

FIG. 1 is a diagram illustrating an example of a computer according toan embodiment of the present invention or a computer which may be usedin an embodiment of the present invention.

A computer (101) includes a CPU (102) and a main memory (103) which areconnected to a bus (104). Preferably, the CPU (102) is based on thearchitecture of 32 bits or 64 bits. The CPU (102) may be, for example,Core™ i series, Core™ 2 series, Atom™ series, Xeon® series, Pentium®series, or Celeron® series by Intel, A series, Phenom™ series, Athlon™series, Turion® series, or Sempron™ by AMD (Advanced Micro Devices), orPower™ series by International Business Machines Corporation.

To the bus (104), a display (106), such as a liquid crystal display(LCD), may be connected via a display controller (105). A liquid crystaldisplay (LCD) may be, for example, a touch panel display or a floatingtouch display. The display (106) may be used for displaying, by asuitable graphic interface, an object to be displayed by runningsoftware which is operating on the computer (101) (for example, acomputer program according to an embodiment of the present invention orvarious computer programs operating on the computer (101)).

To the bus (104), a disk (108), such as a hard disk or a solid statedrive (SSD), may be optionally connected via, for example, an SATA orIDE controller (107).

To the bus (104), a drive (109), such as a CD, DVD, or BD drive, may beoptionally connected via, for example, the SATA or IDE controller (107).

To the bus (104), a keyboard (111) and a mouse (112) may be optionallyconnected via a peripheral device controller (110), such as a keyboardand mouse controller or an USB bus.

The disk (108) may store an operating system, such as z/OS®, z/VM®,z/VSE®, z/TPF, VOS3, UNIX®, Windows®, or MacOS®, a Java® processingenvironment such as J2EE, a Java® application, a Java® virtual machine(VM), a program providing a Java® Just-In-Time (JIT) compiler, acomputer program according to an embodiment of the present invention,and other programs and data in such a manner that they are able to beloaded into the main memory (103).

The disk (108) may be built in the computer (101), may be connected tothe computer (101) through a cable so that the disk (108) may beaccessed by the computer (101), or may be connected to the computer(101) through a wired or wireless network so that the disk (108) may beaccessed by the computer (101).

The drive (109) may be used, as needed, to install programs, such as anoperating system, an application, and a computer program according to anembodiment of the present invention, to the disk (108) from a CD-ROM, aDVD-ROM, or a BD.

A communication interface (114) conforms, for example, to an Ethernet®protocol. The communication interface (114) is connected to the bus(104) via a communication controller (113), has a role of connecting thecomputer (101) to a communication line (115) in a wired or wirelessmanner, and provides a TCP/IP communication protocol, which is acommunication function of an operating system of the computer (101),with a network interface layer. The communication line may be, forexample, a wireless LAN environment according to wireless LAN connectionstandards, a Wi-Fi wireless LAN environment such as IEEE 802.11a/b/g/n,or a cellular phone network environment (for example, a 3G or 4Genvironment).

FIG. 4 is a diagram for explaining a process of switching a hashfunction to a different hash function that expands a selected part of acharacter string, without reconstructing a hash table, according to anembodiment of the present invention, in the case where an index whichindicates that a longest matching character string cannot be found in asearch through individual entries in a bucket chain previouslyregistered in the hash table and thus the search operation is wasted,exceeds a predetermined threshold.

An input stream (401) is a file as a data compression target andincludes character strings. The computer (101) reads character stringsof a predetermined fixed-length-byte from the input stream (401) into abuffer (that is, a sliding window) (not illustrated). It is assumed thatthe computer (101) uses, as data to which the hash function describedbelow is to be applied, “a, a, b”, which is a character string (422)with a predetermined fixed-length of bytes (3 bytes in the example inFIG. 4) and whose starting position is the present position of thecharacter string “a” (present position: 421).

The computer (101) applies a hash function (441) that uses 3 bytes tothe above-mentioned character string (422) and calculates a hash value(491). The computer (101) checks (492), using the calculated hash valueh, whether the hash value h is registered in a dictionary (451). Thecomputer (101) newly registers the hash value h to the dictionary (451).When the hash value h is already registered in the dictionary (451), thecomputer (101) searches through individual entries (461, 462, 463, 464,. . . , and 465) in a bucket chain (451 a) that has the hash value h, tofind (493) a longest character string that matches the character stringstarting from the present position (421).

In the above example illustrated in FIG. 4, since the above calculatedhash value h is registered in the dictionary (451) and a collision ofthe hash value h has occurred, the computer (101) searches through theindividual entries (461, 462, 463, 464, . . . , and 465) in theabove-mentioned bucket chain (451 a) that has the hash value h, to find(493) a longest character string that matches the character stringstarting from the present position (421). The computer (101) searchesfor the longest matching character string (493) up to the end of theentries (461, 462, 463, 464, . . . , and 465) in the above-mentionedbucket chain (451 a) or up to the search upper limit for the entries(461, 462, 463, 464, . . . , and 465). The search upper limit for theentries may be set in such a manner that the higher the compressionlevel (for example, a minimum compression level, a default compressionlevel, or a maximum compression level) of the data compression algorithm(that is, as the compression becomes higher), the larger the number ofentries are searched.

The computer (101) acquires an index which indicates that a longestmatching character string (that is, “a, a, b, c”) cannot be found in thesearch through the individual entries (461, 462, 463, 464, . . . , and465) in the bucket chain (451 a) that has the hash value previouslyregistered in the dictionary (451) and thus the search operation iswasted.

The computer (101) determines whether the above acquired index exceeds apredetermined threshold (494). When the above index exceeds thepredetermined threshold, the computer (101) switches (495) the hashfunction that uses 3 bytes (the hash function currently in use) (441) toa hash function that uses 4 bytes (a different hash function thatexpands a selected part of a character string) (442), withoutreconstructing the dictionary (451). The switching to the new hashfunction that uses 4 bytes (495) is executed on the fly.

It is assumed that the computer (101) continues to use, as data to whichthe hash function described below is to be applied, “a, a, b, d”, whichis a character string (432) with a predetermined fixed-length of bytes(4 bytes in the example in FIG. 4) and whose starting position is thepresent position of the character string “a” (present position: 431).

The computer (101) applies the hash function (442) that uses 4 bytes tothe above-mentioned character string (432) and calculates a hash valueh′ (496). The computer (101) checks (497), using the calculated hashvalue h′, whether the hash value h′ is registered in the dictionary(451).

The contents of the dictionary (451) are updated from the originalcontents, in the respect that the updated contents include characterstrings registered in the above-mentioned bucket chain (451 b), byapplying the hash function (442) that uses 4 bytes, which is acquiredafter switching (495) from the hash function (441) that uses 3 bytes tothe hash function (442) that uses 4 bytes. That is, the dictionary (451)has entries (newly registered entries) registered in the above-mentionedbucket chain (451 b) (481 and 482) (that is, entries having the hashvalue h′ (481 and 482)) by applying the hash function (442) that uses 4bytes. Further, the dictionary (451) also has entries having the hashvalue h′ (483 and 484). The entries (483 and 484) are previouslyregistered in the above-mentioned bucket chain (451 b) by applying thehash function (441) that uses 3 bytes before the above-mentionedswitching is performed.

The computer (101) newly registers the hash value h′ to the dictionary(451). When the hash value h′ is already registered in the dictionary(451), the computer searches through individual entries (481, 482, 483,and 484) in the bucket chain (451 b) that has the hash value h′, to find(498) a longest character string that matches the character stringstarting from the present position (431).

The above-mentioned switching from the hash function that uses 3 bytes(441) to the hash function that uses 4 bytes (442) leads to modifyingthe dictionary into a form with a better search efficiency whencharacter strings are registered in the dictionary.

In the above example illustrated in FIG. 4, since the above calculatedhash value h′ is registered in the dictionary (451) and a collision ofthe hash value h′ has occurred, the computer (101) searches through theindividual entries (481, 482, 483, and 484) in the bucket chain (451 b)that has the hash value h′, to find (498) a longest character stringthat matches the character string starting from the present position(431).

In the above example illustrated in FIG. 4, the computer (101) searchesthrough the entries (481, 482, 483, and 484) in the bucket chain (451b), and finds an entry (481) which has the character string “aabd”. Thatis, it is possible for the computer (101) to find a longest matchingcharacter string from the entries (481) in the bucket chain (451 b) witha small number of entries (that is, the chain is short). Finding theabove-mentioned longest matching character string from the bucket chainwith a small number of entries shortens the search time from a bucketchain, resulting in better performance.

Although the entries (483 and 484) are not the character stringsstarting from the character string “aabd”, they are not harmful. This isbecause the entries (483 and 484) are excluded by a search for amatching character string, and they may be put out of the sliding window(current buffer) soon by the effect of sliding window.

As illustrated in FIG. 4, the process of switching a hash function to adifferent hash function that expands a selected part of a characterstring is especially effective when compressing the data file describedbelow.

Zlib is a type of compression format using a Deflate algorithm, andfunctions as a container of a Deflate stream. The Deflate algorithm isan algorithm for performing data compression that uses a combination ofthe Huffman coding and the LZ77. The Deflate algorithm employs a hashfunction that uses 3 bytes. In the case where the Deflate algorithm isused to create a PDF file, input data may include font data embedded inthe input data. For example, in the case of a TrueType® font, a fontfile includes several tables, such as an hmtx (horizontal metrics) tableand a loca (a location index of outline data in a glyf table) table.Each of the table data is a 4-byte data array and the data is stored inorder. That is, in the 4-byte array, data is arranged with the firstthree bytes being the same and the fourth byte being different.

The above-mentioned feature of the TrueType® file font, that is, thefeature that the above-mentioned table data is a 4-byte data array,causes a large number of collisions between hash values calculated byapplying a hash function that uses 3 bytes (that is, the Deflatealgorithm). Therefore, a bucket chain having a colliding hash valuewhich is previously registered in a hash table becomes long.

According to an embodiment of the present invention, the computer whichcompresses the above-mentioned pdf file, starts compressing theabove-mentioned TrueType® font data in the pdf file by a hash functionthat uses 3 bytes, and detects that the index, which indicates that thesearch operation is wasted, exceeds a predetermined threshold. Next, thecomputer, in response to the detection, switches the hash function thatuses 3 bytes currently in use to a hash function that uses 4 bytes,without reconstructing a hash table. By switching to the hash functionthat uses 4 bytes, the computer registers a character string to the hashtable, using the hash value calculated by applying the hash functionthat uses 4 bytes. Therefore, the table data is well distributed amongdifferent hash values, and thereby the number of hash value collisionsbeing decreased. Thus, the above-mentioned bucket chain is preventedfrom becoming long.

FIG. 5 is a diagram illustrating a process of performing datacompression by switching a hash function to a different hash functionthat expands a selected part of a character string, according to anembodiment of the present invention.

In operation 501, the computer (101) reads a data compression algorithmto the memory (103) and starts the process of data compression. The datacompression algorithm is able to use a hash table as a dictionary andmay be an algorithm for performing data compression while dynamicallycompiling a dictionary. For example, the data compression algorithm maybe a compression algorithm according to the adaptive dictionary method.The compression algorithm according to the adaptive dictionary method isan algorithm that compiles a dictionary while reading a file, withoutpreparing a dictionary beforehand, as described above, and that performscompression by finding a character string in the file that matches theone registered in the dictionary and converting it into a position indexin the dictionary.

In operation 502, the computer (101) reads a file for data compressionfrom, for example, the storage medium (108), uses the file as an inputstream, and reads a predetermined number of character strings in theinput stream into the buffer (103). The buffer (103) may be a slidingwindow.

In operation 503, the computer (101) processes a character string readinto the above-mentioned buffer (103) by moving the character string by1 byte in order from the beginning thereof. That is, the computer (101)selects a character string of a predetermined number of bytes from thepresent position, applying a hash function to the selected part of thecharacter string, and calculates a hash value. Then, using the hashvalue, the computer (101) searches through individual entries in abucket chain that has the hash value previously registered in the hashtable, to find a longest matching character string. The computer (101)performs the process of searching for the longest character string thathas the calculated hash value of the hash function, by shifting thecharacter string in the above buffer (103) by 1 byte in order from thepresent position.

In operation 504, the computer (101) acquires an index which indicatesthat a longest matching character string cannot be found in the search,using the hash value calculated in operation 503, through individualentries in the bucket chain previously registered in the hash table, andthus the search operation is wasted. The computer (101) may acquire theabove-mentioned index, while the data compression algorithm isperforming data compression, for example, continuously, intermittently,or with predetermined time intervals.

The index may be an index represented as follows: (1) a time requiredfor search when an entry of a character string being searched for cannotbe found up to the last entry in a bucket chain having a hash valuecalculated by applying a hash function to a selected part of a characterstring or (2) a time required for search when an entry of a characterstring being searched for cannot be found up to the search upper limitfor entries in a bucket chain having a hash value calculated by applyinga hash function to a selected part of a character string; or (3) afrequency at which an entry of a character string being searched forcannot be found even when search is performed up to the last entry in abucket chain having a hash value calculated by applying a hash functionto a selected part of a character string or (4) a frequency at which anentry of a character string being searched for cannot be found even whensearch is performed up to the search upper limit for entries in a bucketchain having a hash value calculated by applying a hash function to aselected part of a character string.

Each time represented by (1) may correspond to a (actual) time necessaryfor the arithmetic processing unit (for example, a CPU) to performsearch up to the last entry in the bucket chain. Each time representedby (2) may correspond to a (actual) time necessary for the arithmeticprocessing time (for example, a CPU) to perform search through theentries of the character string in the bucket chain up to the searchupper limit.

Each frequency represented by (3) may be a value obtained by dividingthe number of times the search through the entries in the bucket chainwas performed up to the last entry in the bucket chain by the totalnumber of times the search through the entries in the bucket chain wascalled. Each frequency represented by (4) may be a value obtained bydividing the number of times the search through the entries in thebucket chain was performed up to the search upper limit by the totalnumber of times the search through the entries in the bucket chain wascalled.

In (2) and (4), the search upper limit for entries may be set in such amanner that the higher the compression level (for example, a minimumcompression level, a default compression level, or a maximum compressionlevel) of the data compression algorithm (that is, as the compressionbecomes higher), the larger the number of entries are searched. Thesearch upper limit may be, for example, set within a program beforehand.The search upper limit may be, for example, 128 entries in the case ofthe default compression level and 4096 entries in the case of themaximum compression level. The smaller the number of search upper limitentries, the shorter the search time and the lower the compression rate.In contrast, the larger the number of search upper limit entries, thelonger the search time and the higher the compression rate.

In operation 505, the computer (101) determines whether the indexacquired in operation 504 exceeds a predetermined threshold. When theindex exceeds the predetermined threshold, the computer (101) proceedsto operation 506. In contrast, when the index does not exceed thepredetermined threshold, the computer (101) proceeds to operation 507.

The above-mentioned index is used for switching a hash function, asrepresented by operation 506, which will be described below, in order toachieve an object of reducing the time required for search throughentries in a bucket chain up to the last entry or up to the search upperlimit, the problem being generated as the bucket chain of a hash tablebecomes longer, or an object of reducing the number of collisions of ahash value.

In operation 506, the computer (101) switches, when the above-mentionedindex exceeds the predetermined threshold, the hash function currentlyin use to a different hash function that expands a selected part of acharacter string, without reconstructing a hash table. Regardingexpanding a selected part of a character string, in the case where thehash function currently in use is a hash function that uses 3 bytes, forexample, a different hash function that uses 4 bytes, a larger number ofbytes than the above-mentioned 3 bytes, may be used. Therefore, forexample, the computer (101) may switch a hash function that uses 3 bytesto a hash function that uses 4 bytes.

Expanding a selected part of a character string means looking ahead alarger number of bytes of character strings than the number of bytesselected by the original hash function. Therefore, the number ofcollisions of a hash value obtained by the switched hash function issmaller than the number of collisions of a hash value obtained by theoriginal hash function.

By making the number of characters used by the switched hash functionlarger than the number of characters used by the original hash function,the length of entries in a bucket chain newly registered in a hash tablecan be shortened.

The computer (101) performs switching of the hash function on the fly.In response to completion of switching of a hash function, the computer(101) proceeds to operation 507. In operation 507, the computer (101)determines whether character string data to be processed still remainsin the present buffer (103). When character string data to be processedremains, the computer (101) returns to operation 503. When the processreturns to operation 503, the computer (101) shifts the character stringcurrently being processed in the buffer (103) by 1 byte, and performsthe processing explained above in operation 503 for the next input byte,by using the switched hash function. In contrast, when character stringdata to be processed no longer remains, the computer (101) proceeds tooperation 508.

In operation 508, the computer (101) determines whether the nextcharacter strings to be processed exist in the input stream. When thenext character strings exist in the input stream, the computer (101)proceeds to operation 509 or returns to operation 502 in order toperform data compression for the next character strings. In contrast,when the next character string does not exist in the input stream, thecomputer (101) proceeds to termination operation 511.

Operation 509 is optional wherein the computer (101) determines whetherthe switched hash function is to be restored to the original hashfunction. For example, when returning to the original hash function isset, the computer (101) proceeds to operation 510.

Operation 510 is also optional. At a specific timing, the computer (101)restores the different hash function switched in operation 506 to theoriginal hash function. The specific timing may be, for example, atiming when a hash table is cleared or every time that character stringsof a predetermined number of bytes is processed.

Clearing a hash table may be performed, for example, when new characterstrings are read from input data or when new input data is read into asliding window. Therefore, restoring the different hash functionswitched in operation 506 to the original hash function may be performedimmediately before a new input stream is read into a buffer.

With the switched hash function, a short character string which can befound using a hash value calculated from the original hash function,cannot be found. This is because a hash value for a character stringselected by the original hash function (for example, a character stringwith 3 bytes) is generally different from a hash value from a selectedcharacter string by a switched hash function (for example, a characterstring with 4 bytes).

Thus, by restoring the different hash function switched in operation 506to the original hash function at the specific timing, a character stringselected for the original hash function (for example, a character stringwith 3 bytes) can be found again.

When the different hash function switched in operation 506 is restoredto the original hash function, the computer (101) returns to operation502. When the process returns to operation 502, the computer (101)clears the buffer (103), and reads the next predetermined number ofcharacter strings from the input stream into the buffer (103). Then, inthe next operation 503, the computer (101) performs the processingexplained above in operation 503 by using the restored original hashfunction.

In operation 511, the computer (101) reads a data compression algorithminto the memory (103), and ends the process for data compression.

As mentioned above, operation 509 and operation 510 are optional.Therefore, after switching to the different hash function is performedin operation 506, the process may return to operation 502 without goingthrough operation 509 and operation 510. In such a case, when theprocess returns to operation 502, the computer (101) clears the buffer(103), and reads the next predetermined number of character strings fromthe input stream into the buffer (103). In the next operation 503, thecomputer (101) performs the processing explained above in operation 503,by using the switched different hash function. Therefore, when theprocess further proceeds to operation 506, the computer (101) may switchthe switched different hash function to an yet another different hashfunction that further expands a selected part of a character string forthe different hash function.

The data compressed according to the flowchart illustrated in FIG. 5 maybe decoded in a conventional method, irrespective of whether switchingof a hash function has been performed. That is, switching a hashfunction in data compression does not affect the decoding process.

FIG. 6 is a functional block diagram illustrating an example of acomputer that preferably has the hardware configuration according toFIG. 1 and that performs data compression according to an embodiment ofthe present invention.

A computer (601) is a computer that tests the above-mentioned optimizedbinary module, according to an embodiment of the present invention, andmay be, for example, the computer (101) illustrated in FIG. 1.

The computer (601) includes compression means (611), hash table storagemeans (612), index acquisition means (613), and hash function switchingmeans (614). Optionally, the computer (601) also includes hash functionrestoration means (615).

The compression means (611) is able to use a hash table as a dictionary.The compression means (611) executes a desired data compressionalgorithm for compressing data while dynamically creating a dictionary.

The hash table storage means (612) stores a hash table created by thecompression means (611). The hash table may be stored, for example, inthe memory (103) or the storage medium (108).

The index acquisition means (613) acquires an index which indicates thata longest matching character string cannot be found in the searchthrough entries in a bucket chain having a hash value which iscalculated by applying a hash function to a selected part of a characterstring and which is previously registered in a hash table, and thus thesearch operation is wasted. The index may be, for example, the timerepresented by (1) or (2) mentioned above or the frequency representedby (3) or (4) mentioned above.

When the index acquired by the index acquisition means (613) exceeds apredetermined threshold, the hash function switching means (614)switches the hash function currently in use to a different hash functionthat expands a selected part of a character string, withoutreconstructing a hash table.

The hash function restoration means (615) optionally restores thedifferent hash function to the original hash function at a specifictiming.

First Embodiment

According to an embodiment of the present invention, data compression isperformed for the same file (PDF data having an embedded font) at adefault compression level and a maximum compression level by dynamicallyswitching a hash function that uses 3 bytes to a hash function that uses4 bytes (however, processing of restoring to the original hash functionis not performed).

Comparative Example 1

Under the same environment as the first embodiment, data compression isperformed for the same file as in the first embodiment at a defaultcompression level and a maximum compression level, by using the hashfunction that uses 3 bytes, without performing switching of a hashfunction.

Second Embodiment

According to an embodiment of the present invention, data compression isperformed for the same file at a default compression level and a maximumcompression level by dynamically switching a hash function that uses 3bytes to a hash function that uses 4 bytes and further performingprocessing of restoring to the original hash function.

Comparative Example 2

Under the same environment as the second embodiment, data compression isperformed for the same file as in the second embodiment at a defaultcompression level and a maximum compression level by using the hashfunction that uses 3 bytes, without performing switching of a hashfunction.

First Embodiment: Default Compression Level

At the default compression level, the performance is improved by about20 percent (reduction in total execution time), compared to thecomparative example 1. As for the file compression size, the file sizeafter compression according to the first embodiment is improved by about2 percent, compared to the file size after compression according to thecomparative example 1.

First Embodiment: Maximum Compression Level

At the maximum compression level, the performance is improved by about73 percent, compared to the comparative example 1. As for the filecompression size, the file size after compression according to the firstembodiment is improved by about 2 percent, compared to the file sizeafter compression according to the comparative example 1.

Second Embodiment: Default Compression Level

At the default compression level, the performance is improved by about13 percent, compared to the comparative example 2. As for the filecompression size, the file size after compression according to thesecond embodiment is improved by about 1 percent, compared to the filesize after compression according to the comparative example 2.

Second Embodiment: Maximum Compression Level

At the maximum compression level, the performance is improved by about61 percent, compared to the comparative example 2. As for the filecompression size, the file size after compression according to thesecond embodiment is substantially the same as the file size aftercompression according to the comparative example 2.

As is clear from the results in the first embodiment and the secondembodiment described above, according to an embodiment of the presentinvention, a significant improvement in the performance may be achievedwhile maintaining substantially the same file size after compression.

1.-5. (canceled)
 6. An apparatus for performing data compression,comprising: a computing device configured to apply a hash function to aselected part of a character string to calculate a hash value, search,using the hash value, through entries in a bucket chain having the hashvalue previously registered in a hash table, and find a longest matchingcharacter string, the computing device further comprising: indexacquisition means for acquiring an index indicating that a longestmatching character string cannot be found in the search through theentries and thus the search operation is wasted; and hash functionswitching means for switching the hash function to a different hashfunction for expanding the selected part of the character string,without reconstructing the hash table, when the index exceeds apredetermined threshold.
 7. The apparatus of claim 6, further comprisinghash function restoration means for restoring the different hashfunction to the original hash function at a specific timing.
 8. Theapparatus of claim 7, wherein the restoration means restores thedifferent hash function to the original hash function at a time when thehash table is cleared or every time that character strings of apredetermined number of bytes is processed.
 9. The apparatus of claim 6,wherein the index represents a time required for a search when an entryof a character string being searched for cannot be found up to the lastentry in the bucket chain having the hash value or up to a search upperlimit for the entries in the bucket chain having the hash value.
 10. Theapparatus of claim 6, wherein the index represents a frequency at whichan entry of a character string being searched for cannot be found evenwhen the search is performed up to the last entry in the bucket chainhaving the hash value or even when the search is performed up to asearch upper limit for the entries in the bucket chain having the hashvalue.
 11. A non-transitory, computer readable storage medium havingcomputer readable instructions stored thereon that, when executed by acomputer, implement a method of performing data compression, the methodcomprising: applying a hash function to a selected part of a characterstring to calculate a hash value; searching, using the hash value,through entries in a bucket chain having the hash value previouslyregistered in a hash table, and finding a longest matching characterstring; acquiring, an index indicating that a longest matching characterstring cannot be found in the search through the entries and thus thesearch operation is wasted; and switching the hash function to adifferent hash function for expanding the selected part of the characterstring, without reconstructing the hash table, when the index exceeds apredetermined threshold.
 12. The storage medium of claim 11, wherein themethod further comprises restoring the different hash function to theoriginal hash function at a specific timing.
 13. The storage medium ofclaim 12, wherein restoring the different hash function to the originalhash function is performed at a time when the hash table is cleared orevery time that character strings of a predetermined number of bytes isprocessed.
 14. The storage medium of claim 11, wherein the indexrepresents a time required for a search where an entry of a characterstring being searched for cannot be found up to the last entry in thebucket chain having the hash value or up to a search upper limit for theentries in the bucket chain having the hash value.
 15. The storagemedium of claim 11, wherein the index represents a frequency at which anentry of a character string being searched for cannot be found even whenthe search is performed up to the last entry in the bucket chain havingthe hash value or even when the search is performed up to a search upperlimit for the entries in the bucket chain having the hash value.